Walking Back and Forth in Labelled Transition Systems
نویسندگان
چکیده
منابع مشابه
Back and forth bisimulations
This paper is concerned with bisimulation relations which do not only require related agents to simulate each others behavior in the direction of the arrows, but also to simulate each other when going back in history. First it is demonstrated that the back and forth variant of strong bisimulation leads to the same equivalence as the ordinary notion of strong bisimulation. Then it is shown that ...
متن کاملLabelled Transition Systems
ion In concurrency theory it is often useful to distinguish between internal actions, that do not admit interactions with the outside world, and external ones. As normally there is no need to distinguish the internal actions from each other, they all have the same name, namely τ . If A is the set of external actions a certain class of systems may perform, then Aτ := A . ∪ {τ}. Systems in that c...
متن کاملLabelled State Transition Systems
For simplicity, we adopt the following convention: x, x1, x2, y, y1, y2, z, z1, z2, X, X1, X2 are sets, E is a non empty set, e is an element of E, u, v, v1, v2, w, w1, w2 are elements of Eω, F , F1, F2 are subsets of Eω, and k, l are natural numbers. Next we state a number of propositions: (1) For every finite sequence p such that k ∈ dom p holds (〈x〉 a p)(k+ 1) = p(k). (2) For every finite se...
متن کاملReportrapport Generalizing Finiteness Conditions of Labelled Transition Systems Generalizing Finiteness Conditions of Labelled Transition Systems
A labelled transition system is provided with some additional structure by endowing the conngurations and the labels with a complete metric. In this way, a so-called metric labelled transition system is obtained. The additional structure on a metric labelled transition system makes it possible to generalize the niteness conditions nitely branching and image nite to compactly branching and image...
متن کاملGSOS and Finite Labelled Transition Systems
Aceto, L., GSOS and finite labelled transition systems, Theoretical Computer Science 131 (1994) 181-195. Recently there has been considerable interest in studying formats of Plotkin style inference rules which ensure that the induced labelled transition system semantics have certain properties, In this note, I shall give a contribution to this line of research by giving a restricted version of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2014
ISSN: 2075-2180
DOI: 10.4204/eptcs.159.1